regular graph การใช้

• The latter is a strongly regular graph called the local McLaughlin graph.
• In other words, a cubic graph is a 3-regular graph.
• All the cubic distance-regular graphs are known.
• In the cubic distance-regular graphs are known.
• It is the smallest distance-regular graph that is not distance-transitive.
• According to the theorem of, every bipartite regular graph has a 1-factorization.
• The Pappus configuration is the distance-regular graph with 18 vertices and 27 edges.
• It is the smallest 4-regular graph of girth 5 with chromatic number 4.
• The Cages are defined as the smallest regular graphs with given combinations of degree and girth.
• As a cage graph, it is the smallest 4-regular graph with girth 5.
• In such case it is easy to construct regular graphs by considering appropriate parameters for circulant graphs.
• Not every regular graph has a 1-factorization; for instance, the Petersen graph does not.
• It is the unique strongly regular graph with parameters ( 81, 20, 1, 6 ).
• It is a strongly regular graph with parameters srg ( 27, 16, 10, 8 ).
• For regular graphs of degree " k ", the number of spanning trees can be bounded by
• It is usual to use the following notation for a distance-regular graph " G ".
• The dual graph of this embedding is a symmetric 6-regular graph with 12 vertices and 36 edges.
• Random d-regular graphs on " n " vertices are almost Ramanujan, that is, they satisfy
• In the cubic distance-regular graphs are known; the Pappus graph is one of the 13 such graphs.
• The "'Gewirtz graph "'is a strongly regular graph with 56 vertices and valency 10.